Strenthening Hash Functions using Block Symmetric Key Encryption Algorithm

نویسندگان

  • Richa Purohit
  • Yogendra Singh
  • Upendra Mishra
  • Abhay Bansal
چکیده

With the requirement of high speed network protocols, fast message integrity and authentication services are at the top most priority. Currently many integrity techniques, that involve hashing, are being used and developed, but almost every technique faces one or other attack or any other security or performance related issue. The chief problem being faced is the forgery of hash value, being transferred with message, as the adversary may create fraud hash value for the changed message. This paper introduces a DES encryption based hashing technique for message integrity that provides the authentication that message was sent from original sender only, and analyzes its strength. The security of proposed method is based on the strength of the underlying one-way hash function.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetric Encryption Algorithm Inspired by Randomness and Non-Linearity of Immune Systems

In data encryption, the security of the algorithm is measured based on Shannon’s confusion and diffusion properties. This paper identifies the correspondences and highlights the essential computation elements on the basis of randomness and non-linearity of immune systems. These systems can be applied in symmetric encryption algorithm that satisfies the properties in designing a new symmetric en...

متن کامل

PSEC: Provably Secure Elliptic Curve Encryption Scheme (Submission to P1363a)

We describe an elliptic curve encryption scheme, PSEC (provably secure elliptic curve encryption scheme), which has two versions: PSEC-1 and PSEC-2. PSEC-1 is a public-key encryption system that uses the elliptic curve ElGamal trapdoor function and a random function (hash function). PSEC-2 is a public-key encryption system that uses the elliptic curve ElGamal trapdoor function, two random funct...

متن کامل

Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages

This paper considers arbitrary-length chosen-ciphertext secure asymmetric encryption, thus addressing what is actually needed for a practical usage of strong public-key cryptography in the real world. We put forward two generic constructions, gem-1 and gem-2, which apply to explicit fixed-length weakly secure primitives and provide a strongly secure (IND-CCA2) public-key encryption scheme for m...

متن کامل

Combined Differential, Linear and Related-Key Attacks on Block Ciphers and MAC Algorithms

Differential and linear attacks are the most widely used cryptanalytic tools to evaluate the security of symmetric-key cryptography. Since the introduction of differential and linear attacks in the early 1990’s, various variants of these attacks have been proposed such as the truncated differential attack, the impossible differential attack, the square attack, the boomerang attack, the rectangl...

متن کامل

Message Encryption and Authentication Using One-Way Hash Functions

A one-way hash function is an important cryptographic primitive for digital signatures and authentication. Recently much work has been done toward construction of other cryptographic algorithms (e.g., MACs) using hash functions. In particular, such algorithms would be easy to implement with existing codes of hash functions if they are used as a black box without modiication. In this paper we pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012